Another Derivation of the Karmarkar Direction for Linear Programming
نویسنده
چکیده
This paper provides another derivation of the Karmarkar direction for linear programming. It is strongly motivated by derivations of Gonzaga, but we show how the direction can be viewed as a steepest descent direction in the original feasible region corresponding to a metric diierent from the Euclidean one. We show that a xed decrease in the potential function can be obtained by taking a step in this direction, as long as a certain assumption holds. We give an example showing that such a restriction is necessary, and discuss two ways to remove it.
منابع مشابه
An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملOn Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
Interior point methods were widely used in the past in the form of barrier methods. In linear programming, the simplex method dominated, mainly due to inefficiencies of barrier methods. Interior point methods became quit popular again after 1984, when Karmarkar announced a fast polynomial-time interior method for nonlinear programming [Karmarkar, 1984]. In this section we present primal-dual in...
متن کاملA gradient system on the quantum information space that realizes the Karmarkar flow for linear programming
Abstract. In the paper of Uwano [Czech. J. of Phys., vol.56, pp.1311-1316 (2006)], a gradient system is found on the space of density matrices endowed with the quantum SLD Fisher metric (to be referred to as the quantum information space) that realizes a generalization of a gradient system on the space of multinomial distributions studied by Nakamura [Japan J. Indust. Appl. Math., vol.10, pp.17...
متن کاملOn a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations
In a recent paper, the authors have proved results characterizing convexity-preserving maps deened on a subset of a not-necessarily nite dimensional real vector space as projective maps. The purpose of this note is threefold. First, we state a theorem characterizing continuous, injective, convexity-preserving maps from a relatively open, connected subset of an aane subspace of R m into R n as p...
متن کاملComputational Experience with an Interior Point Algorithm on the Satisfiability Problem
We apply the zero-one integer programming algorithm described in Karmarkar [12] and Karmarkar, Resende and Ramakrishnan [13] to solve randomly generated instances of the satisfiability problem (SAT). The interior point algorithm is briefly reviewed and shown to be easily adapted to solve large instances of SAT. Hundreds of instances of SAT (having from 100 to 1000 variables and 100 to 32,000 cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991